Iterative Algorithm Research Articles

ОДНОВИМІРНА ЗГОРТКОВА МОДЕЛЬ НЕЙРОННОЇ МЕРЕЖІ ДЛЯ ОБРОБЛЕННЯ СИГНАЛІВ З АМПЛІТУДНОЮ МОДУЛЯЦІЄЮ БАГАТЬОХ СКЛАДОВИХ

The processing of radio signals using artificial neural networks (ANNs) has great potential for research, which can be explained by the adaptability of ANNs to various transmission conditions and the ability to detect abstract patterns of changes in signal parameters. The article reviews the works of other authors devoted to different ways of using ANNs for processing radio signals. Taking into account the information in the reviewed works, the research task was formed, which consists in developing an optimized ANN model for radio signal processing. Signals with amplitude modulation of many components (AMMC) were chosen to form training samples for ANN. The choice of modulation type is justified by greater energy efficiency compared to other widely used digital modulation types, such as quadrature amplitude modulation. Mathematic basis of AMMC signal generation is described. The process of finding the coordinates of three component 8-AMMC signal constellation is explained, the formation of signals in the time plane based on the found coordinates is explained as well as their discretization and the addition of white noise. An iterative algorithm for generating initial data for ANN based on the described ratios is proposed. The general structure of one-dimensional convolutional neural network is considered. Functions of individual neurons, connections between them, the formation of layers and the convolution operation are described mathematically. On the basis of the previously given ratios, a final display of the network was formed. Specific dimensions and activation functions for layers are selected. The use of convolutional layers is justified by time invariance. Based on the reviewed mathematical models, selected activation functions and dimensions, a neural model was formed. The process of validating the effectiveness of the formed neural model is described, which is based on comparing the symbolic error probabilities of the proposed and reference models at different signal-to-noise ratios. The validation results are presented. The advantages of the obtained model over the previously proposed purely recurrent model and the AMMC reference receiver are explained.

Motion-robust free-running volumetric cardiovascular MRI.

To present and assess an outlier mitigation method that makes free-running volumetric cardiovascular MRI (CMR) more robust to motion. The proposed method, called compressive recovery with outlier rejection (CORe), models outliers in the measured data as an additive auxiliary variable. We enforce MR physics-guided group sparsity on the auxiliary variable, and jointly estimate it along with the image using an iterative algorithm. For evaluation, CORe is first compared to traditional compressed sensing (CS), robust regression (RR), and an existing outlier rejection method using two simulation studies. Then, CORe is compared to CS using seven three-dimensional (3D) cine, 12 rest four-dimensional (4D) flow, and eight stress 4D flow imaging datasets. Our simulation studies show that CORe outperforms CS, RR, and the existing outlier rejection method in terms of normalized mean square error and structural similarity index across 55 different realizations. The expert reader evaluation of 3D cine images demonstrates that CORe is more effective in suppressing artifacts while maintaining or improving image sharpness. Finally, 4D flow images show that CORe yields more reliable and consistent flow measurements, especially in the presence of involuntary subject motion or exercise stress. An outlier rejection method is presented and tested using simulated and measured data. This method can help suppress motion artifacts in a wide range of free-running CMR applications.

Uniqueness and numerical inversion in bioluminescence tomography with time-dependent boundary measurement

Abstract In the paper, an inverse source problem in bioluminescence tomography (BLT) is investigated. BLT is a method of light imaging and offers many advantages such as sensitivity, cost-effectiveness, high signal-to-noise ratio and non-destructivity. It thus has promising prospects for many applications such as cancer diagnosis, drug discovery and development as well as gene therapies. In the literature, BLT is extensively studied based on the (stationary) diffusion approximation (DA) equation, where the distribution of peak sources is reconstructed and no solution uniqueness is guaranteed without proper a priori information. In this work, motivated by solution uniqueness, a novel dynamic coupled DA model is proposed. Theoretical analysis including the well-posedness of the forward problem and the solution uniqueness of the inverse problem are given. Based on the new model, iterative inversion algorithms under the framework of regularizing schemes are introduced and applied to reconstruct the smooth and non-smooth sources. We discretize the regularization functional with the finite element method and give the convergence rate of numerical solutions. Several numerical examples are implemented to validate the effectiveness of the new model and the proposed algorithms.

Toward Robotic Nuclear Decommissioning: Deep Learning-Based Object Classification and Pose Estimation from Partial-View Scans

This study introduces a novel framework for the robotic decommissioning of nuclear facilities, that focuses on object classification and six degrees of freedom pose estimation from partial-view three-dimensional (3-D) scan data. Addressing the challenge of precise robotic manipulation in environments where acquiring full-scan data is impractical, this framework leverages a deep neural network for initial pose estimation, subsequently refined by a modified iterative closest point algorithm. Our method demonstrates high accuracy in identifying scanned objects and estimating their poses from partial-view scans, validated through experiments with 3-D printed mock-ups. This advancement highlights the potential for significantly enhancing robotic automation in nuclear decommissioning and related fields.

Joint Transmit and Receive Beamforming Design for DPC-Based MIMO DFRC Systems

This paper proposes an optimal beamforming strategy for a downlink multi-user multi-input–multi-output (MIMO) dual-function radar communication (DFRC) system with dirty paper coding (DPC) adopted at the transmitter. We aim to achieve the maximum weighted sum rate of communicating users while adhering to a predetermined transmit covariance constraint for radar performance assurance. To make the intended problem trackable, we leverage the equivalence of the weighted sum rate and the weighted minimum mean squared error (MMSE) to reframe the issue and devise a block coordinate descent (BCD) approach to iteratively calculate transmit and receive beamforming solutions. Through this methodology, we demonstrate that the optimal receive beamforming aligns with the traditional MMSE approach, whereas the optimal transmit beamforming design can be cast into a quadratic optimization problem defined on a complex Stiefel manifold. Based on the majorization–minimization (MM) method, an iterative algorithm is then developed to compute the optimal transmit beamforming design by solving a series of orthogonal Procrustes problems (OPPs) that admit closed-form optimal solutions. Numerical findings serve to validate the efficacy of our scheme. It is demonstrated that our approach can achieve at least 73% higher spectral efficiency than the existing methods in a high signal-to-noise ratio (SNR) regime.

An adaptive fusion algorithm for coastal sea altimetry based on dual-frequency Beidou-R carrier phase.

This article proposes an integer ambiguity determination method based on Beidou system-reflectometry (Beidou-R) observations of the carrier phase at the B1I and B3I frequencies. To enhance the accuracy of sea surface height (SSH) estimation, this study introduces a parallel filtering algorithm and an adaptive iterative fusion algorithm, enabling data fusion based on the variance at B1I and B3I frequencies. To validate and evaluate the proposed method, a coastal experiment was conducted at the Shenxian River. In this experiment, reflected signals from GEO and IGSO satellites were collected. Data analysis reveals that the method is effective, demonstrating that the root mean square error (RMSE) of SSH achieves 2.85 cm and 2.89 cm for PRN 04 and PRN 33, respectively. Furthermore, the impact of the elevation angle on measurement accuracy is analyzed. This study aims to propose a method to enhance coastal sea surface height estimation, offering potential advancements in sea surface altimetry.

Ultra-low-dose vs. standard-of-care-dose CT of the chest in patients with post-COVID-19 conditions—a prospective intra-patient multi-reader study

Abstract Objectives To conduct an intrapatient comparison of ultra-low-dose computed tomography (ULDCT) and standard-of-care-dose CT (SDCT) of the chest in terms of the diagnostic accuracy of ULDCT and intrareader agreement in patients with post-COVID conditions. Methods We prospectively included 153 consecutive patients with post-COVID-19 conditions. All participants received an SDCT and an additional ULDCT scan of the chest. SDCTs were performed with standard imaging parameters and ULDCTs at a fixed tube voltage of 100 kVp (with tin filtration), 50 ref. mAs (dose modulation active), and iterative reconstruction algorithm level 5 of 5. All CT scans were separately evaluated by four radiologists for the presence of lung changes and their consistency with post-COVID lung abnormalities. Radiation dose parameters and the sensitivity, specificity, and accuracy of ULDCT were calculated. Results Of the 153 included patients (mean age 47.4 ± 15.3 years; 48.4% women), 45 (29.4%) showed post-COVID lung abnormalities. In those 45 patients, the most frequently detected CT patterns were ground-glass opacities (100.0%), reticulations (43.5%), and parenchymal bands (37.0%). The accuracy, sensitivity, and specificity of ULDCT compared to SDCT for the detection of post-COVID lung abnormalities were 92.6, 87.2, and 94.9%, respectively. The median total dose length product (DLP) of ULDCTs was less than one-tenth of the radiation dose of our SDCTs (12.6 mGy*cm [9.9; 15.5] vs. 132.1 mGy*cm [103.9; 160.2]; p < 0.001). Conclusion ULDCT of the chest offers high accuracy in the detection of post-COVID lung abnormalities compared to an SDCT scan at less than one-tenth the radiation dose, corresponding to only twice the dose of a standard chest radiograph in two views. Clinical relevance statement Ultra-low-dose CT of the chest may provide a favorable, radiation-saving alternative to standard-dose CT in the long-term follow-up of the large patient cohort of post-COVID-19 patients.

Data Completion-guided Unified Graph Learning for Incomplete Multi-View Clustering

Due to its heterogeneous property, multi-view data has been widely concerned over single-view data for performance improvement. Unfortunately, some instances may be with partially available information because of some uncontrollable factors, for which the incomplete multi-view clustering (IMVC) problem is raised. IMVC aims to partition unlabeled incomplete multi-view data into their clusters by exploiting the heterogeneity of multi-view data and overcoming the difficulty of data loss. However, most existing IMVC methods like BSV, MIC, OMVC, and IVC tend to conduct basic completion processing on the input data, without taking advantage of the correlation between samples and information redundancy. To overcome the above issue, we propose one novel IMVC method named Data Completion-guided Unified Graph Learning (DCUGL), which could complete the data of missing views and fuse multiple learned view-specific similarity matrices into one unified graph. Specifically, we first reduce the dimension of the input data to learn multiple view-specific similarity matrices. By stacking all view-specific similarity matrices, DCUGL constructs a third-order tensor with the low-rank constraint, such that sample correlation within and between views can be well explored. Finally, by dividing the original data into observed data and unobserved data, DCUGL can infer and complete the missing data according to the view-specific similarity matrices, and obtain a unified graph, which can be directly used for clustering. To solve the proposed model, we design an iterative algorithm, which is based on the alternating direction method of multipliers (ADMM) framework. The proposed model proves to be superior by benchmarking on six challenging datasets compared with state-of-the-art IMVC methods.

Efficient reliability assessment of slope stability with insightful sensitivity analysis concerning the safety factor

The limit state functions (LSFs) of slope stability are nonlinear, implicit, or derived from numerical simulations, and additional surrogate models are usually used for its reliability problems. Alternatively, an efficient numerical procedure using a variant of the HLRF-BFGS algorithm is proposed to address this issue without additional surrogate models. This proposed procedure simultaneously conducts reliability assessment and sensitivity analysis concerning the safety factor by suggested calculations of partial derivatives using the finite difference method (FDM). Two highly nonlinear numerical examples are presented to validate its convergence and to investigate the step length of the FDM. Results show that the proposed procedure can get considerable accuracy while the HLRF algorithm cannot converge, and its required iterations are about 30% and 81% less than those of the limited step-size iteration algorithm. In addition, a step length not greater than 0.1 is suggested after investigations. Application to a classical two-layered slope is illustrated. Reliability results show that the proposed procedure can get the same accuracy as those of surrogate models after only 5 iterative steps. Sensitivity results show that the cohesion of the upper soil is the only sensitivity factor, and the most possible potential slide surface lies in the upper soil.

A sum‐rate maximization for IRS‐aided broadcast SWIPT with time‐switching structure and nonlinear energy harvester

AbstractThis study evaluates the sum‐rate gain of the intelligent reflecting surface (IRS) in a broadcast simultaneous wireless information and power transfer network. Users are equipped with a time‐switching (TS) structure for an alternating information decoder and a nonlinear energy harvester. The sum‐rate maximization (SRM) problem is formulated subject to the constraints of the energy‐harvesting threshold required by users and limited transmission power at the base station (BS). To address the SRM problem, we jointly designed a broadcast beamforming precoding vector at the BS, reflective phase shifters at the IRS, and TS factors at the users. Subsequently, after certain manipulations, we propose efficient iterative algorithms that combine alternating optimization, successive convex approximation, semidefinite relaxation, and rank‐one penalty function methods to obtain a suboptimal solution. Finally, the numerical results show the promising sum‐rate gain of the proposed scheme compared with the conventional schemes.

Total Least Squares Estimation in Hedonic House Price Models

In real estate valuation using the Hedonic Price Model (HPM) estimated via Ordinary Least Squares (OLS) regression, subjectivity and measurement errors in the independent variables violate the Gauss–Markov theorem assumption of a non-random coefficient matrix, leading to biased parameter estimates and incorrect precision assessments. In this contribution, the Errors-in-Variables model equipped with Total Least Squares (TLS) estimation is proposed to address these issues. It fully considers random errors in both dependent and independent variables. An iterative algorithm is provided, and posterior accuracy estimates are provided to validate its effectiveness. Monte Carlo simulations demonstrate that TLS provides more accurate solutions than OLS, significantly improving the root mean square error by over 70%. Empirical experiments on datasets from Boston and Wuhan further confirm the superior performance of TLS, which consistently yields a higher coefficient of determination and a lower posterior variance factor, which shows its more substantial explanatory power for the data. Moreover, TLS shows comparable or slightly superior performance in terms of prediction accuracy. These results make it a compelling and practical method to enhance the HPM.

Estimation of the Living Vegetation Volume (LVV) for Individual Urban Street Trees Based on Vehicle-Mounted LiDAR Data

The living vegetation volume (LVV) can accurately describe the spatial structure of greening trees and quantitatively represent the relationship between this greening and its environment. Because of the mostly line shape distribution and the complex species of street trees, as well as interference from artificial objects, current LVV survey methods are normally limited in their efficiency and accuracy. In this study, we propose an improved methodology based on vehicle-mounted LiDAR data to estimate the LVV of urban street trees. First, a point-cloud-based CSP (comparative shortest-path) algorithm was used to segment the individual tree point clouds, and an artificial objects and low shrubs identification algorithm was developed to extract the street trees. Second, a DBSCAN (density-based spatial clustering of applications with noise) algorithm was utilized to remove the branch point clouds, and a bottom-up slicing method combined with the random sampling consistency iterative method algorithm (RANSAC) was employed to calculate the diameters of the tree trunks and obtain the canopy by comparing the variation in trunk diameters in the vertical direction. Finally, an envelope was fitted to the canopy point cloud using the adaptive AlphaShape algorithm to calculate the LVVs and their ecological benefits (e.g., O2 production and CO2 absorption). The results show that the CSP algorithm had a relatively high overall accuracy in segmenting individual trees (overall accuracy = 95.8%). The accuracies of the tree height and DBH extraction based on vehicle-mounted LiDAR point clouds were 1.66~3.92% (rRMSE) and 4.23~15.37% (rRMSE), respectively. For the plots on Zijin Mountain, the LVV contribution by the maple poplar was the highest (1049.667 m3), followed by the sycamore tree species (557.907 m3), and privet’s was the lowest (16.681 m3).

Optimization of Energy Efficiency for Federated Learning over Unmanned Aerial Vehicle Communication Networks

Federated learning (FL) is considered a promising machine learning technique that has attracted increasing attention in recent years. Instead of centralizing data in one location for training a global model, FL allows the model training to occur on user devices, such as smartphones, IoT devices, or local servers, thereby respecting data privacy and security. However, implementing FL in wireless communication faces a significant challenge due to the inherent unpredictability and constant fluctuations in channel characteristics. A key challenge in implementing FL over wireless communication lies in optimizing energy efficiency. This holds significant importance, especially considering user devices with restricted power resources. On the other hand, unmanned aerial vehicle (UAV) technologies present a cost-effective solution owing to flexibility and mobility compared to terrestrial base stations. Consequently, the deployment of UAV communication in FL is viewed as a potential approach to deal with the energy efficiency challenge. In this paper, we address the problem of minimizing the total energy consumption of all user equipment (UE) during the training phase of FL over a UAV communication network. Our proposed system facilitates UE to operate concurrently at the same time and frequency, thereby improving bandwidth utilization efficiently. In this paper, we address the problem of minimizing the total energy consumption during the training phase of FL over a UAV communication network. To deal with the proposed nonconvex problem, we propose a novel alternating optimization approach by dividing the problem into two suboptimal problems. We then develop iterative algorithms based on the inner approximation method, yielding at least one locally optimal solution. The numerical results demonstrate the superiority of the proposed algorithm in solving the proposed problem compared to other benchmark algorithms, particularly in determining the optimal trajectory of the UAVs. In addition, we conduct extensive experiments to evaluate how different parameter settings affect performance after implementing the proposed optimization approaches for deploying FL within the UAV communication system. These analyses yield valuable insights into the comparative effectiveness of the proposed optimization algorithms concerning overall energy consumption reduction.

Iterative algorithm to the generalized coupled Sylvester‐transpose matrix equations with application in robust and minimum norm observer design of linear systems

AbstractThis article consider a class of generalized coupled Sylvester‐transpose matrix equations which play an important role in control and systems theory. Based on the Jacobi iterative algorithm, the full‐row rank accelerated Jacobi gradient based iterative (RRAJGI) algorithm and the full‐column rank accelerated Jacobi gradient based iterative (CRAJGI) algorithm are proposed. By using the Frobenius norm of matrix and the trace function of matrix, the convergence of the algorithms are proved. The results show that the new algorithms are convergent for arbitrary initial matrices under the convergence number satisfies appropriate conditions. Numerical examples show that RRAJGI algorithm and CRAJGI algorithm have the advantages of faster convergence speed and higher convergence accuracy than other existing algorithms. Finally, an application example for robust and minimum norm observer design of linear systems is given.

Investigation of a potential upstream harmonization based on image appearance matching to improve radiomics features robustness: a phantom study

Objective. Radiomics is a promising valuable analysis tool consisting in extracting quantitative information from medical images. However, the extracted radiomics features are too sensitive to variations in used image acquisition and reconstruction parameters. This limited robustness hinders the generalizable validity of radiomics-assisted models. Our aim is to investigate a possible harmonization strategy based on matching image quality to improve feature robustness. Approach. We acquired CT scans of a phantom with two scanners across different dose levels and percentages of Iterative Reconstruction algorithms. The detectability index was used as a comprehensive task-based image quality metric. A statistical analysis based on the Intraclass Correlation Coefficient was performed to determine if matching image quality/appearance could enhance the robustness of radiomics features extracted from the phantom images. Additionally, an Artificial Neural Network was trained on these features to automatically classify the scanner used for image acquisition. Main results. We found that the ICC of the features across protocols providing a similar detectability index improves with respect to the ICC of the features across protocols providing a different detectability index. This improvement was particularly noticeable in features relevant for distinguishing between scanners. Significance. This preliminary study demonstrates that a harmonization based on image quality/appearance matching could improve radiomics features robustness and heterogeneous protocols can be used to obtain a similar image appearance in terms of the detectability index. Thus protocols with a lower dose level could be selected to reduce the amount of radiation dose delivered to the patient and simultaneously obtain a more robust quantitative analysis.

Emergency control of firefighting vehicles based on distributed integer programming

Fire-related emergency vehicle scheduling has always been an important part of autonomous vehicle emergency management. To maintain the fire safety of buildings and reduce the transportation loss of emergency resources, this paper constructs a multi-objective integer planning model for fire emergency resource scheduling, which minimizes the time spent in the transportation of fire materials and considers the transportation needs of potential fire vehicles. The fixed-point iterative algorithm is realized and optimized, and distributed computing is adopted to improve the solving speed. In this paper, the comparison and simulation experiments with Branch and Bound, improved particle swarm optimization and other algorithms are carried out. The results show that the model and the algorithm can effectively deal with the fire emergency vehicle scheduling problem under different simulated fires and multiple fires occurring at the same time, and have certain advantages in numerical stability and convergence speed.

Energy-efficient resource allocation for bidirectional wireless power and information transfer over interference channels

Energy efficiency is an important performance metric for the sustainable operation of energy-limited communication networks. This study investigates an energy-efficient resource allocation strategy to maximize the energy efficiency of wireless-powered bidirectional communication over interference channels. The receivers in the system harvest energy and decode information simultaneously using a time switching or power splitting policy from data signals sent by transmitters in the forward link. The harvested energy is subsequently used to send response signals back to the transmitters in the backward link. Our objective is to jointly optimize the transmit power of the transmitters and the energy harvesting ratio of the receivers to maximize the energy efficiency of the entire system while maintaining the minimum required data rates in both the forward and backward links. Considering the non-convexity and NP-hardness of this optimization problem, we first apply nonlinear fractional programming and a dual method to derive an analytical expression for each control parameter and then propose an iterative algorithm to find suboptimal solutions with low computational complexity. The simulation results show that the proposed algorithm adjusts both the transmit power and energy harvesting ratio adaptively considering the co-channel interference and thus achieves near-optimal energy efficiency performance within a short computation time.

Smooth morphing of immersed spherical curves and application to ruled surfaces

In this paper, we realize a rapid, smooth iterative morphing algorithm between two immersed and closed spherical curves of arbitrary turning numbers. By compensating in turning numbers, we linearly interpolate between geodesic curvatures and the side lengths of their accurate spherical polygons approximation. Our algorithm is essentially based on a geometrical closure condition for a flow of spherical polygons involving the variation of both sides and exterior angles. A curvature smoothing flow using discrete geodesic curvature is adopted for smooth curve generation. To demonstrate the good properties of the method, a morphing of spherical curves and ruled surfaces is illustrated.

A gradient-descent iterative learning control algorithm for a non-linear system

Original iterative learning control (OILC) has been proved a powerful tool in dealing with the model-free control problems by repetitively corrections based on the control error. However, the steady-state error under widely-used proportional-type original iterative learning control (P-type OILC) is highly corresponded to the proportional learning gain, making the algorithm parameter-determined. Therefore, a new gradient-descent iterative learning control (GDILC) algorithm is proposed to achieve a parameter-free approach by simulating the gradient-descent process. First, GDILC problem is formulated mathematically. Next, the idea of the algorithm is proposed, the analyses of the convergence and the steady-state error are conducted and the algorithm is implemented. GDILC will generate a random correction with a gradient-descent upper bound, rather than a correction proportional to the error in P-type OILC. Finally, illustrative and application simulations are conducted to validate the algorithm. Results show that the algorithm will be convergent after adequate iterations under proper corrections. The steady-state error will be less affected by the algorithm parameters under GDILC than that under OILC.

Optimal bipartite consensus control for heterogeneous unknown multi-agent systems via reinforcement learning

This study focuses on addressing optimal bipartite consensus control (OBCC) problems in heterogeneous multi-agent systems (MASs) without relying on the agents' dynamics. Motivated by the need for model-free and optimal consensus control in complex MASs, a novel distributed scheme utilizing reinforcement learning (RL) is proposed to overcome these challenges. The MAS network is randomly partitioned into sub-networks where agents collaborate within each subgroup to attain tracking control and ensure convergence of positions and speeds to a common value. However, agents from distinct subgroups compete to achieve diverse tracking objectives. Furthermore, the heterogeneous MASs considered have unknown first and second-order dynamics, adding to the complexity of the problem. To address the OBCC issue, the policy iteration (PI) algorithm is used to acquire solutions for discrete-time Hamilton-Jacobi-Bellman (HJB) equations while implementing a data-driven actor-critic neural network (ACNN) framework. Ultimately, the accuracy of our proposed approach is confirmed through the presentation of numerical simulations.